2017 Lecture 12 Lecturer : Mohsen Ghaffari Scribe : 1 Minimum Spanning Tree
نویسنده
چکیده
In this lecture, we discuss a near-optimal distributed algorithm in the CONGEST model for the problem of computing a minimum spanning tree (MST). We note that, over the years, the problem of computing an MST has turned out to have a central role in distributed algorithms for network optimization problems, significantly more central than its role in the centralized algorithms domain. The upper and lower bound techniques for the MST problem are used frequently in solving other distributed network optimization problems.
منابع مشابه
Distributed MST and Routing in Almost Mixing Time
We present a randomized distributed algorithm that computes a minimum spanning tree in τmix (G ) · 2O ( √ logn log logn) ) rounds, in any n-node graphG with mixing time τmix (G ). This result provides a sub-polynomial complexity for a wide range of graphs of practical interest, and goes below the celebrated Ω̃(D + √ n) lower bound of Das Sarma et al. [STOC’11] which holds for some worst-case gen...
متن کاملLecture 4 Lecturer : Mohsen
In this section, we start the study of LOCAL vertex-coloring algorithms for general graphs. The eventual goal would be to obtain (∆ + 1)-coloring of the graphs — that is, an assignment of colors {1, 2, . . . ,∆ + 1} to vertices such that no two adjacent vertices receive the same color — where ∆ denotes the maximum degree. Notice that by a simple greedy argument, each graph with maximum degree a...
متن کاملImproved Distributed Algorithms for Fundamental Graph Problems
Distributed graph algorithms provide efficient and theoretically sound methods for solving graph problems in distributed settings and more generally for performing distributed computation in networks. These algorithms are applicable in a wide variety of settings, ranging from computer networks to massively parallel computing and beyond. This thesis addresses a number of the central problems of ...
متن کاملDistributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
This paper introduces the concept of low-congestion shortcuts for (near-)planar networks, and demonstrates their power by using them to obtain near-optimal distributed algorithms for problems such as Minimum Spanning Tree (MST) or Minimum Cut, in planar networks. Consider a graph G = (V,E) and a partitioning of V into subsets of nodes S1, . . . , SN , each inducing a connected subgraph G[Si]. W...
متن کاملRandomized Rounding Algorithms for Symmetric TSP 12 - 3 12 . 2 Good Edges , Random Spanning Trees and T - join Polytope
We defined the symmetric TSP in lecture 6. The best known approximation algorithm for STSP is the 3/2 approximation algorithm of Christofides. The algorithm is very easy to describe, first choose a minimum cost spanning tree and then add that minimum cost Eulerian augmentation to the tree, that is the minimum cost set of edges to make the tree Eulerian. An undirected graph is Eulerian when ever...
متن کامل